منابع مشابه
The Interrelation O F Plasmagenes and Chromo - Genes I N Pollen Production I N Maize Donald
IV INHERITED condition of pollen abortion is frequently found in many A species of plants. In maize 20 genes for male sterility are listed by EMERSON, BEADLE and FRASER (193.5). Male sterile-1 reported by SINGLETON and JONES (1930) is on chromosome 6 closely linked with the Y y endosperm locus. All of the gene steriles described are independent recessives, each capable of bringing about either ...
متن کاملReconstructing Visible Regions from Visible Segments
An algorithm is presented for reconstructing visible regions from visible edge segments in object space. This has applications in hidden surface algorithms operating on polyhedral scenes and in cartography. A special case of reconstruction can be formulated as a graph problem: "Determine the faces of a straight-edge planar graph given in terms of its edges." This is accomplished in O(n log n) t...
متن کاملEndovascular coil visible in a visible vessel.
was being admitted for chemotherapy for stage IV ovarian cancer. After large−vol− ume resuscitation, upper gastrointestinal endoscopy was performed because of hematemesis. A large ulcer (2 2 cm) in the posterior wall of the duodenal bulb with a large, actively bleeding visible ves− sel (estimated diameter 5 ± 6 mm) was seen. Despite repeated local epinephrine injections, heater probe coagulat...
متن کاملPotentially Visible Set (PVS)
Many graphics applications today have to cope with large amounts of data. A popular approach to reduce the amount of geometry to be rendered is to precompute visibility in order to render only objects that can be seen from the given viewpoint. This paper presents one technique to achieve this, potentially visible sets (PVS). These sets are used to avoid rendering hidden objects, especially geom...
متن کاملReticulation-Visible Networks
Let X be a finite set, N be a reticulation-visible network on X, and T be a rooted binary phylogenetic tree. We show that there is a polynomial-time algorithm for deciding whether or not N displays T . Furthermore, for all |X| ≥ 1, we show that N has at most 8|X| − 7 vertices in total and at most 3|X| − 3 reticulation vertices, and that these upper bounds are sharp.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Evolution
سال: 1950
ISSN: 0014-3820
DOI: 10.1111/j.1558-5646.1950.tb01409.x